Approximating Coalescing Points for Eigenvalues of Hermitian Matrices of Three Parameters
نویسندگان
چکیده
We consider a Hermitian matrix valued function A(x) ∈ C, smoothly depending on parameters x ∈ Ω ⊂ R, where Ω is an open bounded region of R. We develop an algorithm to locate parameter values where the eigenvalues of A coalesce. We give theoretical justification and implementation details. Finally, we illustrate the technique on several problems. Notation. With A ∈ Cn×n we indicate an n×n complex matrix, and A∗ is the Hermitian of A: A∗ = ĀT . By deafult, we consider the 2-norm for vectors and the induced norm on matrices, though at times we will use also the Frobenius norm ‖ · ‖F for matrices, ‖A‖F = trace(A∗A). A matrix valued function A : R → Cn×n, continuous with its first k derivatives (k ≥ 0), is indicated as A ∈ Ck(R,Cn×n); if k = 0, we also simply write A ∈ C, and in the analytic case we will write A ∈ Cω. If A ∈ Ck(R,Cn×n) is periodic of (minimal) period τ > 0, we write it as A ∈ Ck τ (R,Cn×n). With Ω ⊂ R3 we indicate an open bounded region of R3 diffeomorphic to the open unit ball, and with x = (x1, x2, x3) we indicate coordinates in Ω. The surface bounding Ω will be denoted with S, and it will therefore be diffeomorphic to the standard 2-sphere. The standard unit vectors are denoted e1, e2, e3. For a function A(x), x ∈ Ω, we will write A ∈ Ck(Ω,Cn×n) as appropriate.
منابع مشابه
Hermitian matrices of three parameters: perturbing coalescing eigenvalues and a numerical method
In this work we consider Hermitian matrix valued functions of 3 (real) parameters, and are interested in generic coalescing points of eigenvalues, conical intersections. Unlike our previous works [7, 4], where we worked directly with the Hermitian problem and monitored variation of the geometric phase to detect conical intersections inside a sphere-like region, here we consider the following co...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملSpectral properties of the preconditioned AHSS iteration method for generalized saddle point problems
In this paper, we study the distribution on the eigenvalues of the preconditioned matrices that arise in solving two-by-two block non-Hermitian positive semidefinite linear systems by use of the accelerated Hermitian and skew-Hermitian splitting iteration methods. According to theoretical analysis, we prove that all eigenvalues of the preconditioned matrices are very clustered with any positive...
متن کاملLecture 5: Eigenvalues of Hermitians Matrices
This lecture takes a closer look at Hermitian matrices and at their eigenvalues. After a few generalities about Hermitian matrices, we prove a minimax and maximin characterization of their eigenvalues, known as Courant–Fischer theorem. We then derive some consequences of this characterization, such as Weyl theorem for the sum of two Hermitian matrices, an interlacing theorem for the sum of two ...
متن کاملThree Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds
We show that three well-known perturbation bounds for matrix eigenvalues imply relative bounds: the Bauer-Fike and Hooman-Wielandt theorems for diagonalisable matrices, and Weyl's theorem for Hermitian matrices. As a consequence, relative perturbation bounds are not necessarily stronger than absolute bounds; and the conditioning of an eigenvalue in the relative sense is the same as in the absol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 34 شماره
صفحات -
تاریخ انتشار 2013